Generating matrices of C–nomial coefficients and their spectra
نویسندگان
چکیده
In this paper, we consider a generalization of binomial coefficients, called C– nomial coefficients, dependent upon a sequence {un}n, with indices in arithmetic progressions. We obtain a general recurrence relation and a generating matrix, and point out some new relationships between these coefficients and the generalized Pascal matrices. Further, we obtain generating functions, combinatorial representations, and many new interesting identities and properties of these coefficients.
منابع مشابه
Generalization of Fibonomial Coefficients
Following Lucas and then other Fibonacci people Kwaśniewski had introduced and had started ten years ago the open investigation of the overall F -nomial coefficients which encompass among others Binomial, Gaussian and Fibonomial coefficients with a new unified combinatorial interpretation expressed in terms of cobweb posets’ partitions and tilings of discrete hyperboxes. In this paper, we deal ...
متن کاملOn multi F-nomial coefficients
In response to [6], we discover the looked for inversion formula for F -nomial coefficients. Before supplying its proof, we generalize F -nomial coefficients to multi F -nomial coefficients and we give their combinatorial interpretation in cobweb posets language, as the number of maximal-disjoint blocks of the form σPk1,k2,...,ks of layer 〈Φ1 → Φn〉. Then we present inversion formula for F -nomi...
متن کاملOn multi F-nomial coefficients and Inversion formula for F-nomial coefficients
In response to [7], we discover the looked for inversion formula for F -nomial coefficients. Before supplying its proof, we generalize F -nomial coefficients to multi F -nomial coefficients and we give their combinatorial interpretation in cobweb posets language, as the number of maximal-disjoint blocks of the form σPk1,k2,...,ks of layer 〈Φ1 → Φn〉. Then we present inversion formula for F -nomi...
متن کاملGenerating matrices of Cnomial coe¢ cients and their spectra
In this paper, we consider a generalization of binomial coe¢ cients, called C nomial coe¢ cients, dependent upon a sequence fungn, with indices in arithmetic progressions. We obtain a general recurrence relation and a generating matrix, and point out some new relationships between these coe¢ cients and the generalized Pascal matrices. Further, we obtain generating functions, combinatorial repr...
متن کاملCounting Bipartite, k-Colored and Directed Acyclic Multi Graphs Through F-nomial coefficients
Abstract F-nomial coefficients encompass among others well-known binomial coefficients or Gaussian coefficients that count subsets of finite set and subspaces of finite vector space respectively. Here, the so called F-cobweb tiling sequences N(α) are considered. For such specific sequences a new interpretation with respect to Kwaśniewski general combinatorial interpretation of F -nomial coeffic...
متن کامل